Parallel Discrete Fourier Transform for Fast FIR Filtering Based on Overlapped-save Block Structure
نویسنده
چکیده
To successfully provide a fast FIR filter with FTT algorithms, overlapped-save algorithms can be used to lower the computational complexity and achieve the desired real-time processing. As the length of the input block increases in order to improve the efficiency, a larger volume of zero padding will greatly increase the computation length of the FFT. In this paper, we use the overlapped block digital filtering to construct a parallel structure. As long as the down-sampling (or up-sampling) factor is an exact multiple lengths of the impulse response of a FIR filter, we can process the input block by using a parallel structure and thus achieve a low-complex fast FIR filter with overlapped-save algorithms. With a long filter length, the performance and the throughput of the digital filtering system will also be greatly enhanced. Keywords—FIR Filter, Overlapped-save Algorithm, Parallel Structure
منابع مشابه
Parallel Adaptive Equalizer Employing Sub-Convolution: VLSI Architecture Realized in a Field Programmable Gate Array
Abstract-This paper provides an overview of a parallel adaptive equalizer architecture and its highrate FPGA realization. The very large scale integration (VLSI) architecture for implementing a frequency domain least-mean squares (LMS) complex equalizer incorporates a simple subconvolution method, digital vector processing, specialized FFT-IFFT hardware architectures, and the discrete Fourier t...
متن کاملOptimal Filter Partitions for Real-time Fir Filtering Using Uniformly-partitioned Fft-based Convolution in the Frequency-domain
This paper concerns highly-efficient real-time FIR filtering with low input-to-output latencies. For this type of application, partitioned frequency-domain convolution algorithms are established methods, combining efficiency and the necessity of low latencies. Frequency-domain convolution realizes linear FIR filtering by means of circular convolution. Therefore, the frequency transform’s period...
متن کاملConnecting Partitioned Frequency-Domain Filters in Parallel or in Cascade
The efficient implementation of connected filters is an important issue in signal processing. A typical example is the cascade of two filters, e.g., an adaptive filter with a time-invariant prefilter. The filtering and adaptation is carried out very efficiently in the frequency domain whenever filters with many coefficients are required. This is implemented as a block algorithm by using overlap...
متن کاملImplementation of overlapped block filtering using scheduling by edge reversal
Implementation of overlapped block filtering using Scheduling by Edge Reversal (SER) is proposed in this paper. SER is a very simple and powerful synchronizer. It allows more efficient implementation of parallel structures. This technique is applied for the first time to FIR filters using the overlapped block digital filtering, and implemented on a parallel computer plataform. The results confi...
متن کاملA Fast Algorithm for Long Fir Filters with Small Coefficient Alphabet
This paper presents a fast algorithm for FIR filters with small coefficient alphabet in time domain. Our method outperforms conventional time domain filtering several times in arithmetic complexity in practical applications. It is also competitive with transform domain techniques based on Fast Fourier Transform (FFT). Unlike FFT based methods our approach is accurate and is not using rounding a...
متن کامل